An Algebra of Actors Based on True Concurrency
نویسنده
چکیده
An algebra of actors Aπ fully captures the properties of actors based on asynchronous π-calculus, but, it is based on the interleaving bisimulation semantics. We adjust Aπ to Aπtc to make Aπ having a truly concurrent semantics. We give the syntax and operational semantics of Aπtc, and also the truly concurrent semantics model and algebraic laws of Aπtc.
منابع مشابه
Algebraic Laws for True Concurrency
We find the algebraic laws for true concurrency. Eventually, we establish a whole axiomatization for true concurrency called APTC (Algebra for Parallelism in True Concurrency). The theory APTC has four modules: BATC (Basic Algebra for True Concurrency), APTC (Algebra for Parallelism in True Concurrency), recursion and abstraction. And also, we show the applications and extensions of APTC.
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملImplementing Condition/Event Nets in the Circal Process Algebra
We define a translation from Condition/Event nets to the Circal process algebra. Such a translation exploits the Circal feature of allowing the simultaneous occurrence of distinct actions. This permits us to give Condition/Event nets a semantics based on true concurrency, in addition to the interleaving-based semantics. In this way the true concurrency aspects of Condition/Event nets are preser...
متن کاملReactive Programming using the Algebra of Communicating Processes
R&D on reactive programming is growing and this has delivered quite many language constructs, libraries and tools. Scala programmers can use threads, timers, actors, futures, promises, observables, the async construct, and others. Still it seems to us that the state of the art is not mature: reactive programming is relatively hard, and confidence in correct operation depends mainly on extensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1705.02427 شماره
صفحات -
تاریخ انتشار 2017